Double-coset enumeration algorithm for symmetrically generated groups
نویسنده
چکیده
The Todd-Coxeter algorithm described in [13] remains a primary reference for coset enumeration programs. It may be viewed as a means of constructing permutation representations of finitely presented groups. A number of effective computer programs for singlecoset enumeration have been described, see, for example, [2, 7, 8]. Enumerating double cosets, rather than single cosets, gives substantial reduction in total cosets defined which leads to minimizing the storage (and time) needed. In [8, 9] Linton has developed two double-coset enumeration programs. The process in the earlier one, which is a corrected version of the algorithm proposed in [3], is viewed as a direct generalization of the ordinary single-coset enumeration. The later one is related to the present algorithm but with different calculations. In this paper, we present a double-coset enumeration algorithm which is specially developed for groups symmetrically generated by involutions. Several finite groups, including all nonabelian finite simple groups, can be generated by symmetric sets of involutions, see, for example, [6, 10, 11]. The algorithm has been implemented as a Magma [1] program and this implementation has been used with success to check symmetric presentations for many finite simple groups.
منابع مشابه
Coset Enumeration of Symmetrically Generated Groups Using Gröbner Bases
A new method for coset enumeration in symmetrically generated groups is presented. This method is based on a Gröbner bases algorithm applied to polynomials in non-commuting variables with integer coefficients. Mathematics Subject Classification: 05A05; 20B05; 20B40
متن کاملCoset enumeration of groups generated by symmetric sets of involutions
The well-known Todd-Coxeter algorithm [14], which may be viewed as a means of constructing permutation representations of finitely presented groups, remains a primary reference for coset enumeration programs. All the strategies and variants of this algorithm perform essentially the same calculations as the original algorithm, merely choosing different orders in which to process the available in...
متن کاملCombinatorial method in the coset enumeration of symmetrically generated groups
We give an algorithm for enumerating cosets of a group defined as a finite homomorphic image of a semi-direct product of free products of cyclic groups by a group of monomial automorphisms. Lots of finite groups, including some of the sporadic simple groups can be defined in this mannar. Mathematics Subject Classification: 20Bxx
متن کاملConstructing Matrix Representations of Finitely Presented Groups
The Todd-Coxeter coset enumeration algorithm is one of the most powerful tools of computational group theory. It may be viewed as a means of constructing permutation representations of nitely presented groups. In this paper we present an analogous algorithm for directly constructing matrix representations over many elds. In fact the algorithm is more general than this, and can be used to constr...
متن کاملA Note on Nielsen Reduction and CosetEnumerationBirgit Reinert
Groups can be studied using methods from diierent elds such as combina-torial group theory or string rewriting. Recently techniques from Grr obner basis theory for free monoid rings (non-commutative polynomial rings) respectively free group rings have been added to the set of methods due to the fact that monoid and group presentations (in terms of string rewriting systems) can be linked to spec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Math. Mathematical Sciences
دوره 2005 شماره
صفحات -
تاریخ انتشار 2005